منابع مشابه
Designing Complex Networks
We suggest a new perspective of research towards understanding the relations between structure and dynamics of a complex network: Can we design a network, e.g. by modifying the features of units or interactions, such that it exhibits a desired dynamics? Here we present a case study where we positively answer this question analytically for networks of spiking neural oscillators. First, we presen...
متن کاملRequirements Engineering Model in Designing Complex Systems
This research tends to development of the requirements elicitation methodology with regard to operational nature and hierarchical analysis for complex systems and also, regarding available technologies. This methodology applies Analytic Hierarchy Process (AHP) and Analytic Network Process (ANP) to ensure traceability of planned qualitative and quantitative data from requirements to available te...
متن کاملRequirements Engineering Model in Designing Complex Systems
This research tends to development of the requirements elicitation methodology with regard to operational nature and hierarchical analysis for complex systems and also, regarding available technologies. This methodology applies Analytic Hierarchy Process (AHP) and Analytic Network Process (ANP) to ensure traceability of planned qualitative and quantitative data from requirements to available te...
متن کاملDesigning Networks Incrementally
We consider the problem of incrementally designing a network to route demand to a single sink on an underlying metric space. We are given cables whose costs per unit length scale in a concave fashion with capacity. Under certain natural restrictions on the costs (called the Access Network Design constraints), we present a simple and efficient randomized algorithm that is competitive to the mini...
متن کاملDesigning Optimal Flow Networks∗
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations and flows. The network may contain other unprescribed nodes, known as Steiner points. For concave increasing cost functions, a minimum cost network of this sort has a tree topology, and hence can be called a Minimum Gilbert Arborescence (MGA). We characteris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2006
ISSN: 0167-2789
DOI: 10.1016/j.physd.2006.09.037